Splitting of overlapping nuclei guided by robust combinations of concavity points
نویسندگان
چکیده
In this work, we propose a novel and robust method for the accurate separation of elliptical overlapped nuclei in microscopic images. The method is based on both the information provided by the global boundary of the nuclei cluster and the detection of concavity points along this boundary. The number of the nuclei and the area of each nucleus included in the cluster are estimated automatically by exploiting the different parts of the cluster boundary demarcated by the concavity points. More specifically, based on the set of concavity points detected in the image of the clustered nuclei, all the possible configurations of candidate ellipses that fit to them are estimated by least squares fitting. For each configuration, an index measuring the fitting residual is computed and the configuration providing the minimum error is selected. The method may successfully separate multiple (more than two) clustered nuclei as the fitting residual is a robust indicator of the number of overlapping elliptical structures even if many erroneous concavity points are present due to noise. Moreover, the algorithm has been evaluated on cytological images of conventional Pap smears and compares favorably with state of the art methods both in terms of accuracy and execution time.
منابع مشابه
An improved generalized Hough transform overlapping objects
The generalized Hough transform (GHT) is a powerful method for recognizing arbitrary shapes as long as the correct match accounts for both much of the model and much of the sensory object. For moderate levels of occlusion, however, the GHT can hypothesize many false solutions. In this paper, we present an improved two-stage GHT procedure for the recognition of overlapping objects. Each boundary...
متن کاملMorphological Separation of Clustered Nuclei in Histological Images
Automated nuclear segmentation is essential in the analysis of most microscopy images. This paper presents a novel concavitybased method for the separation of clusters of nuclei in binary images. A heuristic rule, based on object size, is used to infer the existence of merged regions. Concavity extrema detected along the merged-cluster boundary are used to guide the separation of overlapping re...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملRobust line segmentation for handwritten documents
Line segmentation is the first and the most critical pre-processing step for a document recognition/analysis task. Complex handwritten documents with lines running into each other impose a great challenge for the line segmentation problem due to the absence of online stroke information. This paper describes a method to disentangle lines running into each other, by splitting and associating the ...
متن کاملClump splitting through concavity analysis
We present a novel method of decomposing digital binary clumps into constituent convex parts. The algorithm is based on the analysis of concavities to determine where splitting should occur. Two relative concavity measures, concavity degree and concavity weight, are also defined.
متن کامل